气固两相流全分辨率直接数值模拟的并行算法

用沉浸边界法对气固两相流进行全分辨率直接数值模拟,介绍并行算法及其并行效率。考察球形颗粒的空间分辨率等对计算精度的影响,对颗粒雷诺数Rep=1~150,颗粒直径与计算网格比大于20时,该并行算法获得的计算精度较高。     

基于几何统计差异性的伪造印鉴识别方法

针对印鉴识别任务中有效印文的提取以及伪造印鉴的识别这两个难点问题,建立在监督分类体系下的印鉴识别系统.利用有效印文与背景的颜色统计差异以及真伪印鉴间的几何统计差异分别解决上述难点.在构建的包含3000个印鉴的印鉴数据库上进行实验,实验结果表明,该方法对于有效印文的提取准确率可达到(95.27±3.73％),对于伪造印鉴的识别准确率可达到97.62％,具有可行性和有效性.     

Failure load prediction of structural adhesive joints : Part 2: Experimental study

The objective of this study was to determine how the fracture of adhesive joints depends on elastic beam parameters describing the adherends and the applied loads. The basic specimen geometry was the cracked lap shear joint constructed of aluminium alloy with various adherend and bondline thicknesses. Loads were applied in different combinations of bending, tension and shear to generate a failure envelope for each adhesive and specimen geometry. It was found that crack propagation for precracked specimens occured at a critical strain energy release rate but was also a function of the G_I/G_II ratio and the bondline thickness. The experiments also showed that the loads required to propagate a crack in a precracked specimen were always lower than the loads required to break the fillet. Hence, by treating uncracked joints as being cracked, where the fictitious crack tip is assumed to coincide with the location of the fillet, a conservative estimate of the failure load is obtained.     

计算思维影响下的应用型本科计算机基础教学改革探索

当前以计算思维能力培养为切入点的大学计算机课程改革工作已进入一个新的阶段,如何改革计算机基础教学以适应当前形势的发展,是计算机基础教学面临的挑战。以计算思维为导向,对应用型本科院校大学计算机基础课程的目标定位、教学内容、教学过程等教学环节作改革式探索。     

计算思维导向的计算机程序设计课程教学改革研究

根据程序设计类课程与计算思维之间的内在联系,提出以“案例教学、趣味教学、微课堂”为根本的教学改革,阐述如何在新的人才培养模式下构建教学方法,即通过优化教学内容、创新实践方法等一系列举措,将程序设计的思想与方法转化为学生的创新精神和创新能力。     

On the complexity of role updating feasibility problem in RBAC

In Role Based Access Control (RBAC) systems, it is necessary and important to update the role–permission assignments in order to reflect the evolutions of the system transactions. However, role updating is generally complex and challenging, especially for large-scale RBAC systems. This is because the resulting state is usually expected to meet various requirements and constraints. In this paper, we focus on a fundamental problem of role updating in RBAC, which determines whether there exists a valid role–permission assignment, i.e., whether it can satisfy all the requirements of the role updating and without violating any role–capacity or permission–capacity constraint. We formally define such a problem as the Role Updating Feasibility Problem (RUFP), and study the computational complexity of RUFP in different subcases. Our results show that although several subcases are solvable in linear time, this problem is NP-complete in the general case.     

Holographic algorithms on bases of rank 2

An essential problem in the design of holographic algorithms is to decide whether the required signatures can be realized under a suitable basis transformation (SRP). For holographic algorithms with matchgates on domain size 2, , ,  and  have built a systematical theory. In this paper, we reduce SRP on domain size k≥3$k\ge 3$ to SRP on domain size 2 for holographic algorithms with matchgates on bases of rank 2. Furthermore, we generalize the collapse theorem of [3] to domain size k≥3$k\ge 3$.     

Order-k α-hulls and α-shapes

We introduce order-k α-hulls and α-shapes – generalizations of α-hulls and α-shapes. Being also a generalization of k-hull (known in statistics as “k-depth contour”), order-k α-hull provides a link between shape reconstruction and statistical depth. As a generalization of α-hull, order-k α-hull gives a robust shape estimation by ignoring locally up to k outliers in a point set. Order-k α-shape produces an “inner” shape of the set, with the amount of “digging” into the points controlled by k. As a generalization of k-hull, order-k α-hull is capable of determining “deep” points amidst samples from a multimodal distribution: it correctly identifies points which lie outside clusters of samples.The order-k α-hulls and α-shapes are related to order-k Voronoi diagrams in the same way in which α-hulls and α-shapes are related to Voronoi diagrams. This implies that order-k α-hull and α-shape can be readily built from order-k Voronoi diagram, and that the number of different order-k α-shapes for all possible values of α is proportional to the complexity of order-k Voronoi diagram.     

New method for the on-line signature verification based on horizontal partitioning

Verification of identity based on the analysis of dynamic signatures is an important problem of biometrics. The effectiveness of the verification significantly increases when the dynamic characteristics of signature (e.g. velocity of the pen) are considered. These characteristics are individual for each user and difficult to imitate. The effectiveness of the verification can be further improved by using partitioning. In this paper we propose a new method which uses partitioning. In our method partitions represent areas of high and low speed of signature and high and low pen?s pressure. All selected partitions are used by our algorithm, but more important in the classification process are these partitions, in which the signatures of the user acquired during training phase are more stable. Moreover, final classification is interpretable. In this paper we present the simulation results of the proposed method for the two databases: SVC2004 and BioSecure Database.